What's decidable about weighted automata?
نویسندگان
چکیده
Weighted automata map input words to values, and have numerous applications in computer science. A result by Krob from the 90s implies that universality problem is decidable for weighted over tropical semiring with weights N ? { ? } undecidable when are Z . We continue study of borders decidability semiring. give a complete picture complexity various decision problems them, including non-emptiness, universality, equality, containment. For undecidability results, we provide direct proofs, which stay terrain state machines. This enables us tighten results apply them very simple class automata. In addition, toolbox algorithms techniques automata, on top establish bounds.
منابع مشابه
What's Decidable about Weighted Automata?
Weighted automata map input words to numerical values. Applications of weighted automata include formal verification of quantitative properties, as well as text, speech, and image processing. In the 90’s, Krob studied the decidability of problems on rational series, which strongly relate to weighted automata. In particular, it follows from Krob’s results that the universality problem (that is, ...
متن کاملDecidable and Undecidable Problems about Quantum Automata
We study the following decision problem: is the language recognized by a quantum finite automaton empty or nonempty? We prove that this problem is decidable or undecidable depending on whether recognition is defined by strict or nonstrict thresholds. This result is in contrast with the corresponding situation for probabilistic finite automata, for which it is known that strict and nonstrict thr...
متن کاملWhat ' s Decidable about Hybrid Automata ? 1
Hybrid automata model systems with both digital and analog components, such as embedded control programs. Many veriication tasks for such programs can be expressed as reachability problems for hybrid au-tomata. By improving on previous decidability and un-decidability results, we identify the precise boundary between decidability and undecidability of the reachability problem for hybrid automat...
متن کاملWhat's Decidable About Hybrid Automata? y
Hybrid automata model systems with both digital and analog components, such as embedded control programs. Many veri cation tasks for such programs can be expressed as reachability problems for hybrid automata. By improving on previous decidability and undecidability results, we identify a boundary between decidability and undecidability for the reachability problem of hybrid automata. On the po...
متن کاملWeighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” which increase while the system evolves but do not constrain the behaviour of the system. In this paper, we prove two main results: (i) optimal o-minimal hybrid games are decidable; (ii) the model-checking of WCTL, an extension of CTL ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information & Computation
سال: 2022
ISSN: ['0890-5401', '1090-2651']
DOI: https://doi.org/10.1016/j.ic.2020.104651